La Réduction des Réseaux en Crytographie = Lattice reduction in CryptographyJoux, Antoine; Stern, Jacques.1993, 82 p.Thesis

Sacs à ods orthogonaux et sacs à dos divisibles = Orthogonal and divisible knapsacksHARARI, S.TS. Traitement du signal. 1992, Vol 9, Num 3, pp 273-279, issn 0765-0019Article

Approximating the Orthogonal Knapsack Problem for HypercubesHARREN, Rolf.Lecture notes in computer science. 2006, pp 238-249, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Removable online knapsack problemsIWAMA, Kazuo; TAKETOMI, Shiro.Lecture notes in computer science. 2002, pp 293-305, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

The use of duality to improve the efficiency of methods of solving the quadratic knapsack problemKISELEV, V. D; SUKMANOV, S. A.Computational mathematics and mathematical physics. 1993, Vol 33, Num 2, pp 287-288, issn 0965-5425Article

Satisfiability problem and lattice basis problem = Problème de satisfaisabilité et problème de réseauxHusain, Dhiaiddin; Morel, H.1996, 88 p.Thesis

Sensitivity analysis for knapsack problems : a negative resultBLAIR, C.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 133-139, issn 0166-218XArticle

An attacking method for multiplicative Knapsack type public key cryptosystem based on finite fieldKUROSAWA, K; ITOH, T; SHIGETA, H et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1987, Vol 70, Num 1, pp 37-41, issn 0387-236XArticle

A new enumeration scheme for the Knapsack problemYANASSE, H. H; SOMA, N. Y.Discrete applied mathematics. 1987, Vol 18, Num 2, pp 235-245, issn 0166-218XArticle

On separating cover inequalities for the multidimensional knapsack problemBEKTAS, Tolga; OGUZ, Osman.Computers & operations research. 2007, Vol 34, Num 6, pp 1771-1776, issn 0305-0548, 6 p.Article

Cryptanalysis of the Chor-Rivest cryptosystemVAUDENAY, Serge.Journal of cryptology. 2001, Vol 14, Num 2, pp 87-100, issn 0933-2790Article

A new fully polynomial time approximation scheme for the knapsack problemKELLERER, H; PFERSCHY, U.Journal of combinatorial optimization. 1999, Vol 3, Num 1, pp 59-71, issn 1382-6905Article

A polynomial-time algorithm for knapsack with divisible item sizesVERHAEGH, W. F. J; AARTS, E. H. L.Information processing letters. 1997, Vol 62, Num 4, pp 217-221, issn 0020-0190Article

Core problems in bi-criteria {0, 1}-knapsack problemsDA SILVA, Carlos Gomes; CLIMACO, Joao; FIGUEIRA, Jose Rui et al.Computers & operations research. 2008, Vol 35, Num 7, pp 2292-2306, issn 0305-0548, 15 p.Article

On aggregating two linear Diophantine equationsNAN ZHU; BROUGHAN, K.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 231-246, issn 0166-218XArticle

Hilbert bases and the facets of special knapsack polytopes,WEISMANTEL, R.Mathematics of operations research. 1996, Vol 21, Num 4, pp 886-904, issn 0364-765XArticle

A nonlinear Knapsack problemHOCHBAUM, D. S.Operations research letters. 1995, Vol 17, Num 3, pp 103-110, issn 0167-6377Article

The inverse-parametric knapsack problemBURKARD, R. E; PFERSCHY, U.European journal of operational research. 1995, Vol 83, Num 2, pp 376-393, issn 0377-2217Conference Paper

An exact algorithm for the 0-1 collapsing knapsack problemFAYARD, D; PLATEAU, G.Discrete applied mathematics. 1994, Vol 49, Num 1-3, pp 175-187, issn 0166-218XArticle

Matroidal relaxations for 0-1 knapsack problemsAMADO, L; BARCIA, P.Operations research letters. 1993, Vol 14, Num 3, pp 147-152, issn 0167-6377Article

A stochastic linear knapsack problemSHIODE, S; ISHII, H; NISHIDA, T et al.Naval research logistics. 1987, Vol 34, Num 5, pp 753-759, issn 0894-069XArticle

A dynamic access control scheme based upton the knapsack problemJINN-KE JAN; SHIUH-JENG WANG.Computers & mathematics with applications (1987). 1993, Vol 26, Num 12, pp 75-86, issn 0898-1221Article

A characterization of knapsacks with the max-flow-min-cut propertyLAURENT, M; SASSANO, A.Operations research letters. 1992, Vol 11, Num 2, pp 105-110, issn 0167-6377Article

A complementary greedy heuristic for the knapsnack problemWHITE, D. J.European journal of operational research. 1992, Vol 62, Num 1, pp 85-95, issn 0377-2217Article

(1,k)-Configuration facets for the generalized assignment problemGOTTLIEB, E. S; RAO, M. R.Mathematical programming. 1990, Vol 46, Num 1, pp 53-60, issn 0025-5610Article